Increasing integrity of watermarks using robust features

ABSTRACT

This invention relates to a method and an arrangement for embedding a watermark pattern in an information signal. A method of embedding a watermark pattern in an information signal comprising the steps of determining a robust signature as a set of robust features in said information signal, creating a watermark pattern as a signature dependent function of a predefined basic watermark pattern and embedding said watermark pattern in said information signal. The invention also relates to a corresponding method and arrangement for detecting a watermark pattern in an information signal.

The invention relates to a method and an arrangement for embedding auxiliary data, such as a watermark in an information signal, e.g. a video signal, an audio signal, or more generally, multimedia content. The invention also relates to a method and arrangement for detecting said watermark pattern and a device for recording and/or playing back an information signal.

The auxiliary data may e.g. be a digital watermark, which preferably (but not necessarily) is an imperceptible label that is embedded/added to an information/host signal e.g. comprising multimedia content, video, audio, etc. The label may contain for instance copyright information, the name of the owner of the material, rights for a user etc. The amount of information that may be stored in or derived on the basis of a watermark is usually referred to as a payload and is expressed in bits.

In most watermark schemes the watermark is a pseudo-random noise sequence (pn-sequence), which is added to a host signal/information signal in either the time, spatial or a transformed domain (e.g. Fourier, Discrete Cosine or Wavelet Domain). Watermark detection is then usually based on a correlation between the watermark and the embedded host signal. In this case we have a 1 bit payload for the watermark, i.e. the noise sequence is either present or it is not present.

A recognized problem in the security of watermarking is the so-called copy attack. This attack estimates a watermark from an embedded host signal and subsequently the estimated watermark can be transplanted in a second signal. If the second signal was originally unmarked then a signal is generated which in terms of watermarking assumes identity of the embedded host signal. Further if the second signal was already marked with a watermark then the newly created signal might confuse watermark detectors.

In order to avoid the copy-attack one option is to make the watermark dependent on the content of the host signal. This is done by extracting a robust signature (a set of robust features) from the content of the host signal and the watermark is made dependent on this signature. A robust signature is a set of variables that is representative of the essentials of the host signal. If e.g. the host signal is a video signal, then ideally a slight change in the image represented by the video signal leads to no change in the signature, whereas a complete different image results in a radically different signature.

A known method of accomplishing a coupling between signature and watermark is by letting the watermark pattern depend on the signature. This is done by using a function f(·), from which the watermark pattern results, when the signature is inserted. This can also be described as W=f(S), where W is the watermark pattern and S is the signature bitstring. The function f(S) could e.g. be a random number generator generating the watermark, where the signature S is used as the seed of the generator. Alternatively a number of fixed basic patterns W_(i) could be available and W is determined according to the following W=Σ_(i)b_(i)W_(i) where b_(i) are the signature bits.

Yet another possibility is to select the watermark pattern W from a set pre-generated of watermark patterns, where the selection is based on the signature S. This is described in patent application WO 01/39121.

The above methods lead to detection problems when the signature changes very quickly such as a “flashy” video clip. In known watermarking systems, the watermark is embedded in frames of the host signal. When detecting the watermark in the host signal, all the frames in a time period of e.g. 2 seconds are accumulated in a buffer. Thereby the watermarks in each frame add up coherently, improving the signal to noise ratio for the watermark detection. After the accumulation step the buffer is correlated with the watermark pattern, and the result is compared to a threshold. If the signature changes too quickly as described in the above method, then the watermark pattern changes very quickly and therefore there is little possibility of accumulation, resulting in the watermark detection being both very complex and unreliable.

It is an object of the invention to provide a method and arrangement for embedding additional/auxiliary data in an information signal where the method and arrangement solves the above-mentioned problems.

This is achieved by a method (and corresponding arrangement) of embedding a watermark pattern (W) in an information signal (X) comprising the steps of: determining a robust signature (S) as a set of robust features of said information signal (X), generating a watermark pattern (W) on the basis of a first signature dependent function (f_(S)(·)) applied to a predefined basic watermark pattern (V), embedding said watermark pattern (W) in said information signal (X) resulting in a watermarked signal (Y), where there exist a relationship of said first signature dependent function (f_(S)(·)) and a second signature dependent function (g_(S)(·)) given by that a given detection operation (D) on said watermarked signal (Y) and said first function (f_(S)(·)), applied to said basic watermark pattern (V), i.e. D(Y;f_(S)(V)), corresponds to said detection operation (D) on said second function (g_(S)(·)), applied to said watermarked signal (Y), and said basic watermark (V), i.e. D(g_(S)(Y);V).

The corresponding method (and corresponding arrangement) of detecting a basic watermark pattern (V) in an information signal (Y) with an embedded watermark pattern (W), said method comprising the steps of: determining a robust signature (S) as a set of robust features in said information signal (Y), generating a signal (Z) on the basis of a second signature dependent function (g_(S)(·)) of said information signal (Y), detecting said basic watermark pattern (V) from said signal (Z), where there exist a relationship of said second signature dependent function (g_(S)(·)) and a first signature dependent function (f_(S)(·)) given by that a given detection operation (D) on said information signal (Y) and said first function (f_(S)(·)), applied to said basic watermark pattern (V), i.e. D(Y;f_(S)(V)), corresponds to said detection operation (D) on said second function (g_(S)(·)), applied to said information signal (Y), and said basic watermark (V), i.e. D(g_(S)(Y);V).

Preferred embodiments of the invention are defined in the sub claims.

Hereby, the information in the watermark depends on the information signal and the watermark can only be detected in combination with information from the information signal. Thereby it is not possible to copy the watermark and use it on another information signal with different information.

FIG. 1 shows an embodiment of an embedding arrangement according to the present invention;

FIG. 2 illustrates a schematic diagram of a detector according to the present invention;

FIG. 3 illustrates an alternative embodiment of a detector according to the present invention;

FIG. 4 shows a device for recording and/or playing back an information multi-media bit stream with an embedded watermark.

For the sake of convenience the invention will be described as a system for embedding/attaching labels, preferably invisible to the human eye, to video content but the teachings can obviously be applied to any other contents including audio and muitimedia. Additionally, an embodiment for detecting one label is also described.

FIG. 1 shows an embodiment of an embedding arrangement according to the present invention. A source provides an information signal X to be embedded with auxiliary information/a watermark. The source may e.g. provide an image, an audio signal, a signal with multimedia content, etc. As an example used in the following the information signal X is a time dependent signal, such as a DVD video signal. Also shown is embedding means (107), which adds a watermark W to the information signal/image X.

The watermark W is generated by first extracting a robust signature from the information signal X, this robust signature is a set of robust features extracted from the content of the information signal X. The extraction is performed using signature extraction means (101) and the output of the signature extraction means (101) is a signature S.

The signature S is used as input to the watermark generating means (105) together with a fixed basic pattern also called the basic watermark pattern V. The watermark generating means (105) determine a watermark pattern W as a signature dependent, invertible linear function f_(S)(·) of the basic watermark pattern V. W=f _(S)(V).

The watermark pattern W is embedded in the information signal X by the embedding means (107) and an information signal Y is generated comprising the watermark pattern W. Y=X+W=X+f _(S)(V).

Alternatively, the watermark pattern that is embedded in the information signal X is a tiled watermark pattern of the watermark pattern W.

In a specific embodiment, the function f_(S)(·) is a permutation function, i.e. it generates an output where the order of the bits of the input is changed, shuffled, etc. Permutation/calculation means (105) performs a permutation of the basic pattern dependent on the signature S. In this particular case, the basic watermark pattern V and the watermark W is defined as V={v_(K)}, K=1 . . . N, W={w_(L)}, L=1 . . . N, where an invertible and signature dependent function φ_(S) is defined, and the watermark signal W is determined according to the following w _(i) =v _(j), where j=φ _(S)(i).

In another embodiment, a positive integer q_(S) being coprime to N is defined for each value of the signature S, and the watermark signal W is determined according to the following w _(i) =v _(j), where j=q _(S) *i mod N

In yet another embodiment, the function f_(S)(·), being dependent of the signature S, changes the signs of the basic watermark pattern V. A signature dependent pattern P_(S) could be generated having the same size as the basic watermark pattern V, with each entry of P_(S) being equal to +1 or −1 depending on a specific signature. In this way, the function dependent of the signature f_(S)(·) may be defined according to W=f _(S)(V)=P _(S) *V i.e., w _(i)=(P _(S))_(i) v _(i), where (P _(S))_(i)=1 or (P _(S))_(i)=1

FIG. 2 illustrates a schematic diagram of a detector according to the present invention. Shown is an information/host signal Y, which possibly contains a watermark to be detected.

A signature S is extracted from the information signal Y. The extraction is performed using signature extraction means (201) and the output of the signature extraction means (201) is a signature S.

The signature S is used to generate an inverse signature dependent function f_(S) ⁻¹ and a signal Z is generated by (203) using the watermarked signal Y as input to the inverse signature dependent function f_(S) ⁻¹(·), Z=f _(S) ⁻¹(Y)

Thereby a signal Z is obtained and by correlating the basic watermark pattern V with Z it is possible to detect whether the basic watermark pattern is present in the signal Z. Since Y=X+f_(S)(V), Z=f _(S) ⁻¹(Y)=f _(S) ⁻¹(X+f _(S) ⁻¹(V))=f _(S) ⁻¹(X)+V

The detection is performed by the watermark detection means (205), which has the signal Z and the basic watermark pattern V as input.

In more general terms it is possible to regenerate the basic watermark pattern because of the following:

-   -   There is an embedding operator E and a detection operator D.         Y=E(X,W)         R=D(Y,W), where R denotes the detection result

The function f_(S)(·) should be such that there exists another function g_(S)(·) such that D(Y,f_(S)(V))=D(g_(S)(Y),V). In the case of additive embedding this leads to the necessary property that f_(S) is linear and g_(S)=f_(S) ⁻¹ (and hence the necessary property that f is invertible).

A further advantageously embodiment is shown in FIG. 3 where the watermark detection is done for groups of frames/samples. By accumulating using accumulating means (304) a number of frames the statistics of detection is improved and therefore also the reliability of detection, which is especially advantageous since the value of correlation values for a present watermark is less since only a part of the noise signal/watermark actually is embedded. Here Z is added to the accumulation buffer/means (304). V does not depend on the signature, so the watermark patterns V add up coherently in the accumulation buffer thereby avoiding the problem of accumulating signature dependent material.

The embedded information may identify, for example, the copy-right holder, a description of the content and/or rights associated with the use of the content. In DVD copy-protection it would allow material to be labeled as ‘copy once’, ‘never copy’, ‘copy no more’, etc. FIG. 4 shows a device, e.g. a DVD player, for recording and/or playing back an MPEG encoded bit stream with an embedded watermark. The bit stream is recorded/stored on a information medium like a DVD disc 401. The recorded signal is applied to an output terminal 403 via a switch 402. The output terminal 403 is connected to an external MPEG decoder and display device (not shown). It is assumed that the DVD player may not play back video signals with a predetermined embedded watermark, unless other conditions are fulfilled which are not relevant to the present invention. For example, watermarked signals may only be played back if the medium 401 includes a so-called “wobble” key. In order to detect the watermark, the DVD player comprises a watermark detector 404 as described above. The detector receives the recorded signal and controls the switch 403 in response to whether or not the watermark is detected and/or what the value of the auxiliary data/the payload signifies.

It should be noted that the above-mentioned embodiments illustrate rather than limit the invention, and that those skilled in the art will be able to design many alternative embodiments without departing from the scope of the appended claims. In the claims, any reference signs placed between parentheses shall not be construed as limiting the claim. The word ‘comprising’ does not exclude the presence of other elements or steps than those listed in a claim. The invention can be implemented by means of hardware comprising several distinct elements, and by means of a suitably programmed computer. In a device claim enumerating several means, several of these means can be embodied by one and the same item of hardware. The mere fact that certain measures are recited in mutually different dependent claims does not indicate that a combination of these measures cannot be used to advantage. 

1. A method of embedding a watermark pattern (W) in an information signal (X) comprising the steps of: determining a robust signature (S) as a set of robust features of said information signal (X), generating a watermark pattern (W) on the basis of a first signature dependent function (f_(S)(·)) applied to a predefined basic watermark pattern (V), embedding said watermark pattern (W) in said information signal (X) resulting in a watermarked signal (Y), where there exist a relationship of said first signature dependent function (f_(S)(·)) and a second signature dependent function (g_(S)(·)) given by that a given detection operation (D) on said watermarked signal (Y) and said first function (f_(S)(·)), applied to said basic watermark pattern (V), i.e. D(Y;f_(S)(V)), corresponds to said detection operation (D) on said second function (g_(S)(·)), applied to said watermarked signal (Y), and said basic watermark (V), i.e. D(g_(S)(Y);V).
 2. A method according to claim 1 wherein said first function (f_(S)(·)) is an invertible and linear function, and said second function (g_(S)(·)) is an inverse function of said signature dependent function (f_(S)(·)), i.e. g_(S)=f_(S) ⁻¹.
 3. A method according to claim 1 wherein said first function f_(S)(·) is a permutation function, i.e. a function that rearranges/reorders at least a part of an input bit string resulting in an rearranged output bit string.
 4. A method according to claim 1, wherein said watermark pattern (W) is defined as W={w_(L)}, L=1 . . . N, said basic watermark pattern (V) is defined as V={V_(K)}, K=1 . . . N, and wherein the watermark pattern W is determined according to the following w _(i) =v _(j), where j=φ _(S)(i), where φ_(S) is an invertible signature dependent function.
 5. A method according to claim 4, wherein said invertible, signature dependent function φ_(S) is defined according to j=φ _(S)(i)=q _(S) *i mod N, where q_(S) is a positive integer and coprime to N, and where q_(S) is defined for each of said robust signatures (S).
 6. A method according to claim 1 wherein said watermark pattern (W) is obtained from the basic watermark pattern (V) by modifying the signs of the basic pattern (V) according to the following: W=P _(S) *V, where P_(S) is a signature dependent pattern having the same size as the basic watermark pattern (V), with each entry of P_(S) being equal to either +1 or −1.
 7. A method for detecting a basic watermark pattern (V) in an information signal (Y) with an embedded watermark pattern (W), said method comprising the steps of: determining a robust signature (S) as a set of robust features in said information signal (Y), generating a signal (Z) on the basis of a second signature dependent function (g_(S)(·)) of said information signal (Y), detecting said basic watermark pattern (V) from said signal (Z), where there exist a relationship of said second signature dependent function (g_(S)(·)) and a first signature dependent function (f_(S)(·)) given by that a given detection operation (D) on said information signal (Y) and said first function (f_(S)(·)), applied to said basic watermark pattern (V), i.e. D(Y;f_(S)(V)), corresponds to said detection operation (D) on said second function (g_(S)(·)), applied to said information signal (Y), and said basic watermark (V), i.e. D(g_(S)(Y);V).
 8. A method according to claim 7, wherein said first signature dependent function (f_(S)(·)) is an invertible and linear function, and said second signature dependent function (g_(S)(·)) is an inverse function of said first function (f_(S)(·)), i.e. g_(S)=f_(S) ⁻¹.
 9. A method according to claim 7 wherein said first function f_(S)(·) is a permutation function, i.e. a function that rearranges/reorders at least a part of an input bit string resulting in an rearranged output bit string, and wherein the embedded watermark pattern (W) has been generated during embedding as a predefined signature dependent permutation by applying said first function f_(S)(·) to said basic watermark pattern (V), where the signal (Z) is generated by undoing said predefined permutation on the information signal (Y).
 10. A method according to claim 7, wherein said watermark pattern (W) is defined as W={w_(L)}, L=1 . . . N, said basic watermark pattern is defined as V={v_(K)}, K=1 . . . N, and wherein the watermark pattern W is determined according to the following w _(i) =v _(j), where j=φ _(S)(i), where φ_(S) is an invertible signature dependent function.
 11. A method according to claim 10 wherein said invertible, signature dependent function φ_(S) is defined according to j=φ _(S)(i)=q _(S) *l mod N, where q_(S) is a positive integer and coprime to N, and where q_(S) is defined for each of said robust signatures (S).
 12. A method according to claim 7, wherein the embedded watermark pattern (W) has been generated during embedding from the basic watermark pattern (V) by modifying the signs of the basic pattern (V) according to the following: W=P _(S) *V, where P_(S) is a signature dependent pattern having the same size as the basic watermark pattern (V), with each entry of P_(S) being equal to either +1 or −1, and where the signal (Z) is generated by undoing said modifying of the signs on the information signal (Y).
 13. A method according to claim 7, wherein the method further comprises the step of storing the signal (Z) in an accumulation buffer, and detecting said basic watermark (V) by correlating the information in the accumulation buffer with said basic watermark pattern (V). V={v_(K)}, K=1 . . . N
 14. An arrangement for embedding a watermark pattern (W) in an information signal (X) comprising: means for determining a robust signature (S) as a set of robust features in said information signal (X), means for generating a watermark pattern (W) on the basis of a first signature dependent function (f_(S)(·)) applied to a predefined basic watermark pattern (V), means for embedding said watermark pattern (W) in said information signal (X) resulting in a watermarked signal (Y), where there exist a relationship of said first signature dependent function (f_(S)(·)) and a second signature dependent function (g_(S)(·)) given by that a given detection operation (D) on said watermarked signal (Y) and said first function (f_(S)(·)), applied to said basic watermark pattern (V), i.e. D(Y;f_(S)(V)), corresponds to said detection operation (D) on said second function (g_(S)(·)), applied to said watermarked signal (Y), and said basic watermark (V), i.e. D(g_(S)(Y);V).
 15. An arrangement for detecting a basic watermark pattern (V) in an information signal (Y) with an embedded watermark pattern (w), said arrangement comprising: means for determining a robust signature (S) as a set of robust features in said information signal (Y), means for generating a signal (Z) on the basis of a second signature dependent function (g_(S)(·)) of said information signal (Y), means for detecting said basic watermark pattern (V) from said signal (z), where there exist a relationship of said second signature dependent function (g_(S)(·)) and a first signature dependent function (f_(S)(·)) given by that a given detection operation (D) on said information signal (Y) and said first function (f_(S)(·)), applied to said basic watermark pattern (V), i.e. D(Y;f_(S)(V)), corresponds to said detection operation (D) on said second function (g_(S)(·)), applied to said information signal (Y), and said basic watermark (V), i.e. D(g_(S)(Y);V).
 16. A device for recording and/or playing back an information signal, the device comprising means (402) for disabling recording and/or playback of the information signal in dependence upon a basic watermark pattern (V) embedded in said information signal (Y) wherein the device further comprises an arrangement (404) for detecting said basic watermark pattern (V) according to claim
 15. 17. A device for transmitting an information signal, the device comprising an arrangement for embedding a watermark pattern (W) in an information signal (X) comprising: means for determining a robust signature (S) as a set of robust features in said information signal (X), means for generating a watermark pattern (W) on the basis of a first signature dependent function (f_(S)(·)) applied to a predefined basic watermark pattern (V), means for embedding said watermark pattern (W) in said information signal (X) resulting in a watermarked signal (Y), where there exist a relationship of said first signature dependent function (f_(S)(·)) and a second signature dependent function (g_(S)(·)) given by that a given detection operation (D) on said watermarked signal (Y) and said first function (f_(S)(·)), applied to said basic watermark pattern (V), i.e. D(Y;f_(S)(V)), corresponds to said detection operation (D) on said second function (g_(S)(·)), applied to said watermarked signal (Y), and said basic watermark (V), i.e. D(g_(S)(Y);V).
 18. An information signal (Y) with an embedded watermark pattern (W), said watermark pattern (W) being generated on the basis of a first signature dependent function (f_(S)(·)) applied to a predefined basic watermark pattern (V), said function (f_(S)(·)) depends on a robust signature (S) of said information signal (Y), where there exist a relationship of said first signature dependent function (f_(S)(·)) and a second signature dependent function (g_(S)(·)) given by that a given detection operation (D) on said information signal (Y) and said first function (f_(S)(·)), applied to said basic watermark pattern (V), i.e. D(Y;f_(S)(V)), corresponds to said detection operation (D) on said second function (g_(S)(·)), applied to said information signal (Y), and said basic watermark (V), i.e. D(g_(S)(Y);V).
 19. An information signal (Y) according to claim 18, wherein said first function f_(S)(·) is a permutation function, i.e. a function that rearranges/reorders at least a part of an input bit string resulting in an rearranged output bit string.
 20. An information signal (Y) according to claim 18, wherein said watermark pattern (W) is obtained from the basic watermark pattern (V) by modifying the signs of the basic pattern (V) according to the following: W=P _(S) *V, where P_(S) is a signature dependent pattern having the same size as the basic watermark pattern (V), with each entry of P_(S) being equal to either +1 or −1.
 21. A storage medium (401) having stored thereon an information signal (Y) with an embedded watermark pattern (W), said watermark pattern (W) being generated on the basis of a first signature dependent function (f_(S)(·)) applied to a predefined basic watermark pattern (V), said function (f_(S)(·)) depends on a robust signature (S) of said information signal (Y), where there exist a relationship of said first signature dependent function (f_(S)(·)) and a second signature dependent function (g_(S)(·)) given by that a given detection operation (D) on said information signal (Y) and said first function (f_(S)(·)), applied to said basic watermark pattern (V), i.e. D(Y;f_(S)(V)), corresponds to said detection operation (D) on said second function (g_(S)(·)), applied to said information signal (Y), and said basic watermark (V), i.e. D(g_(S)(Y);V). 